package cn.pugle.oj.leetcode;

import cn.pugle.oj.catalog.DynamicProblem;

/**
 * 前几个蛋都二分, 最后一个蛋挨层试的思路不对!!!
 * https://blog.csdn.net/qunqunstyle99/article/details/80954752
 * https://www.cnblogs.com/Harry-Lord/p/4002846.html
 * 两个蛋100层答案14的比较好想,
 *
 * @author tzp
 * @since 2020/9/21
 */
public class LC887_1 implements DynamicProblem {
    /**
     * @param K 蛋的个数
     * @param N 总楼层数 1-N
     */
    public int superEggDrop(int K, int N) {
        return -1;
    }

    public static void main(String[] args) {
        System.out.println(Math.pow(100, 1 / 2.0));
        System.out.println(Math.log(1024) / Math.log(2));
        System.out.println(new LC887_1().superEggDrop(2, 2));//2
        System.out.println(new LC887_1().superEggDrop(2, 3));//2
        System.out.println(new LC887_1().superEggDrop(2, 4));//3
        System.out.println(new LC887_1().superEggDrop(2, 6));//3
        System.out.println(new LC887_1().superEggDrop(3, 8));//4
        System.out.println(new LC887_1().superEggDrop(3, 14));//4
    }
}
